Search
Back to Home
01. Motion Planning
02. Introduction to Path Planning
03. About this Lesson
04. Motion Planning
05. Compute Cost
06. Compute Cost 2
07. Optimal Path
08. Optimal Path 2
09. Maze
10. Maze 2
11. First Search Program
12. Expansion Grid
13. Print Path
14. A*
15. Implement A*
16. A* in Action
17. Dynamic Programming
18. Computing Value
19. Computing Value 2
20. Value Program
21. Optimum Policy
22. Left Turn Policy
23. Planning Conclusion
Back to Home
17. Dynamic Programming
Dynamic Programming
Pause
Play
% buffered
00:00
00:00
Unmute
Mute
Disable captions
Enable captions
Settings
Captions
Disabled
Quality
undefined
Speed
Normal
Captions
Go back to previous menu
Disabled
en
EN
JP
JP
ja
JA
ru
RU
CN
CN
Quality
Go back to previous menu
Speed
Go back to previous menu
0.5×
0.75×
Normal
1.25×
1.5×
1.75×
2×
Exit fullscreen
Enter fullscreen
Play
Next Concept